- constraint function
- функция связи
Авиасловарь. М.А.Левин. 2004.
Авиасловарь. М.А.Левин. 2004.
Constraint-induced movement therapy — (CI or CIMT) is a form of rehabilitation therapy that improves upper extremity function in stroke and other Central Nervous System damage victims by increasing the use of their affected upper limb. The focus of CIMT is to combine restraint of… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Constraint Grammar — (CG) is a methodological paradigm for Natural language processing (NLP). Linguist written, context dependent rules are compiled into a grammar that assigns grammatical tags ( readings ) to words or other tokens in running text. Typical tags… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Constraint optimization — In constraint satisfaction, constrained optimization (also called constraint optimization) seeks for a solution maximizing or minimizing a cost function. Contents 1 Definition 2 Solution methods 2.1 Branch and bound … Wikipedia
Constraint (mathematics) — In mathematics, a constraint is a condition that a solution to an optimization problem must satisfy. There are two types of constraints: equality constraints and inequality constraints. The set of solutions that satisfy all constraints is called… … Wikipedia
Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… … Wikipedia
Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia